Applying Extended Finite State Machines in Software Testing of Interactive Systems

نویسندگان

  • Marcelo Fantinato
  • Mario Jino
چکیده

Model Based Testing (MBT) is a functional testing technique that makes use of information from behavioral models of the software to carry out the testing task. This technique has been commonly used in testing of interactive systems, where the used model represents the system behavior reacting to user’s actions. Finite State Machines (FSMs) are one of the most used modeling techniques for MBT. However, traditional FSMs do not provide mechanisms to model important behavioral aspects of the software such as its data flow. This paper proposes an extension to the traditional FSMs, which provides data flow modeling mechanisms and is used as a basis to define a set of functional testing criteria, extending known structural testing criteria. Moreover, the application of the defined functional testing criteria is compared, through a practical experiment, to the application of their corresponding structural testing criteria – both applied as adequacy criteria.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Restricted cascade and wreath products of fuzzy finite switchboard state machines

A finite switchboard state machine is a specialized finite state machine. It is built by binding the concepts of switching state machines and commutative state machines. The main purpose of this paper is to give a specific algorithm for fuzzy finite switchboard state machine and also, investigates the concepts of switching relation, covering, restricted cascade products and wreath products of f...

متن کامل

A Concept for Testing and Diagnosis of Embedded Systems based on Extended Finite States Machines

Due to the growing complexity of embedded systems and their requirements in reliability and real-time capability, support methods to help designers and testers at the different phases of the development cycle are needed. In areas such network protocol testing automatic test generation has been used successfully. Here, the method of extended finite state machines is applied to embedded systems. ...

متن کامل

Adaptation of State/Transition-Based Methods for Embedded System Testing

In this paper test generation methods and appropriate fault models for testing and analysis of embedded systems described as (extended) finite state machines ((E)FSMs) are presented. Compared to simple FSMs, EFSMs specify not only the control flow but also the data flow. Thus, we define a two-level fault model to cover both aspects. The goal of this paper is to reuse well-known FSM-based test g...

متن کامل

Mutation testing from probabilistic and stochastic finite state machines

Specification mutation involves mutating a specification, and for each mutation a test is derived that distinguishes the behaviours of the mutated and original specifications. This approach has been applied with finite state machines based models. This paper extends mutation testing to finite state machine models that contain non-functional properties. The paper describes several ways of mutati...

متن کامل

Some improvements in fuzzy turing machines

In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003